Search results for "Axiom of choice"

showing 3 items of 3 documents

Finiteness in a Minimalist Foundation

2008

We analyze the concepts of finite set and finite subset from the perspective of a minimalist foundational theory which has recently been introduced by Maria Emilia Maietti and the second author. The main feature of that theory and, as a consequence, of our approach is compatibility with other foundational theories such as Zermelo-Fraenkel set theory, Martin-Lof's intuitionistic Type Theory, topos theory, Aczel's CZF, Coquand's Calculus of Constructions. This compatibility forces our arguments to be constructive in a strong sense: no use is made of powerful principles such as the axiom of choice, the power-set axiom, the law of the excluded middle.

General set theoryMorse–Kelley set theoryNon-well-founded set theoryZermelo–Fraenkel set theoryConstructive set theoryminimalist foundation; finite sets; finite subsets; type theory; constructive mathematicsconstructive mathematicsfinite subsetsUrelementMathematics::LogicType theorytype theoryComputer Science::Logic in Computer ScienceAxiom of choicefinite setsminimalist foundationMathematical economicsMathematics
researchProduct

The forgotten mathematical legacy of Peano

2019

International audience; The formulations that Peano gave to many mathematical notions at the end of the 19th century were so perfect and modern that they have become standard today. A formal language of logic that he created, enabled him to perceive mathematics with great precision and depth. He described mathematics axiomatically basing the reasoning exclusively on logical and set-theoretical primitive terms and properties, which was revolutionary at that time. Yet, numerous Peano’s contributions remain either unremembered or underestimated.

PeanoPeano's axioms of arithmeticPeano's counterexamplesWeierstrass maximum theoremabstract measuresGeneral MathematicsClosure (topology)tangencyinterioranti-distributive familiesfoundationdefinitions by abstractionlinear differential equationsaxiom of choiceLogical conjunctionPeano axiomsproofFormal languageAxiom of choiceMSC: Primary 01A55 01A6003-03 26-03 28-03 34-03 54-03; Secondary15A75 26A03 26A2426B25 26B05 28A1228A15 28A75.affine exterior algebra[MATH]Mathematics [math]reduction formulaeMathematicsnonlinear differential equationsoptimality conditionsdifferentiation of measuressweeping-tangent theoremPeano's axioms of geometryPeano's filling curvereduction of mathematics to setssurface areaclosuremean value theoremDirichlet functionNonlinear differential equationssubtangentsEpistemologymeasure theoryplanar measurelower and upper limits of setsdistributive familiescompactnessmathematical definitions1886 existence theoremdifferentiabilityDissertationes Mathematicae
researchProduct

Towards Axiomatic Basis of Inductive Inference

2001

The language for the formulation of the interesting statements is, of course, most important. We use first order predicate logic. Our main achievement in this paper is an axiom system which we believe to be more powerful than any other natural general purpose discovery axiom system. We prove soundness of this axiom system in this paper. Additionally we prove that if we remove some of the requirements used in our axiom system, the system becomes not sound. We characterize the complexity of the quantifier prefix which guaranties provability of a true formula via our system. We prove also that if a true formula contains only monadic predicates, our axiom system is capable to prove this formula…

SoundnessDiscrete mathematicsPredicate logicSMorse–Kelley set theoryComputer scienceNon-well-founded set theoryZermelo–Fraenkel set theoryConstructive set theoryInductive reasoningAxiom schemaUrelementScott's trickMonad (functional programming)First-order logicAxiom of extensionalityMathematics::LogicTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSCalculusAxiom of projective determinacyAxiom of choiceKripke–Platek set theoryAction axiomAxiom
researchProduct